An Axiomatization of Full Computation Tree Logic
نویسنده
چکیده
We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic. ?
منابع مشابه
Temporal logics with reference pointers and computation tree logics
A complete axiomatic system CTL rp is introduced for a temporal logic for nitely branching ! +-trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL into CTL rp. In particular, that yields a complete axiomatization for the translations of all valid CTL-formulae. Thus, the temporal ...
متن کاملQuantum Computation Tree Logic – Model checking and complete calculus
Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper we consider Quantum Computation Tree Logic (QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine the standard CTL model-checking algorithm with the dEQPL model-checking algorithm to obtain a mode...
متن کاملConceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗, is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS∗ are applied to tree structures. We prove a th...
متن کاملOn Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
A branching bisimulation for probabilistic systems that is preserved under parallel composition has been defined recently for the alternating model. We show that besides being compositional, it is decidable in polynomial time and it preserves the properties expressible in probabilistic Computation Tree Logic (pCTL). In the ground-complete axiomatization, only a single axiom is added to the axio...
متن کاملExtended Full Computation-tree Logics for Paraconsistent Model Checking
It is known that the full computation-tree logic CTL∗ is an important base logic for model checking. The bisimulation theorem for CTL∗ is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL∗ and 4LCTL∗ of CTL∗ are shown, and a translation from 4CTL∗ into CTL∗ is presented. By using 4CTL∗ and 4LCTL∗, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 66 شماره
صفحات -
تاریخ انتشار 2001